Congruences and Ideals in a Distributive Lattice with Respect to a Derivation
نویسندگان
چکیده
Two types of congruences are introduced in a distributive lattice, one in terms of ideals generated by derivations and the other in terms of images of derivations. An equivalent condition is derived for the corresponding quotient algebra to become a Boolean algebra. An equivalent condition is obtained for the existence of a derivation. 2000 Mathematics Subject Classification: 06D99, 06D15.
منابع مشابه
On lattice of basic z-ideals
For an f-ring with bounded inversion property, we show that , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring with bounded inversion property, we prove that is a complemented...
متن کاملFuzzy Group Ideals and Rings
This section define a level subring or level ideals obtain a set of necessary and sufficient condition for the equality of two ideals and characterizes field in terms of its fuzzy ideals. It also presents a procedure to construct a fuzzy subrings (fuzzy ideals) from any given ascending chain of subring ideal. We prove that the lattice of fuzzy congruence of group G (respectively ring R) is isom...
متن کاملIdeals of Almost Distributive Lattices with respect to a Congruence
The concept of -ideals is introduced in an Almost Distributive lattice(ADL) with respect to a congruence and the properties of -ideals are studied. Derived a set of equivalent conditions for a -ideal to become a -prime ideal.
متن کاملBoolean Lifting Properties for Bounded Distributive Lattices
In this paper, we introduce the lifting properties for the Boolean elements of bounded distributive lattices with respect to the congruences, filters and ideals, we establish how they relate to each other and to significant algebraic properties, and we determine important classes of bounded distributive lattices which satisfy these lifting properties.
متن کاملTree Structure for Distributive Lattices and its Applications
From a well-known decomposition theorem, we propose a tree representation for distributive and simplicial lattices. We show how this representation (called ideal tree) can be efficiently computed (linear time in the size of the lattice given by any graph whose transitive closure is the lattice) and compared with respect to time and space complexity. As far as time complexity is concerned, we si...
متن کامل